package binarysearchtree;

public class Test {
    public static void main(String[] args) {
        int[] array = new int[]{4,7,1,3,0,12,5,9};
        BinarySearchTree tree = new BinarySearchTree();
        for(int i = 0; i < array.length; i++) {
            tree.insert(array[i]);
        }
//        System.out.println(tree.search(12));
//        System.out.println(tree.search(100));
        tree.remove(4);
        System.out.println("======");
    }
}
